Optimally rescheduling jobs with a Last-In-First-Out buffer

نویسندگان

چکیده

Abstract This paper considers single-machine scheduling problems in which a given solution, i.e., an ordered set of jobs, has to be improved as much possible by re-sequencing the jobs. The need for rescheduling may arise different contexts, e.g., due changes job data or because local objective stage supply chain that is not aligned with sequence. A common production setting entails movement jobs (or parts) on conveyor. reflected our model facilitating via buffer limited capacity accessible LIFO policy. We consider classical functions total weighted completion time, maximum lateness and (weighted) number late study their complexity. For three these problems, we present strictly polynomial-time dynamic programming algorithms, while case minimizing NP-hardness proven pseudo-polynomial algorithm given.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Teenagers in Their First Jobs

IT is widely recognised that many young people entering their first job meet with disillusionment and disappointment. At first glance, this seems rather surprising, since only a short time earlier the same individual boys and girls yearned to commence work, deplored the short-comings of their teachers, moaned about their home-work and hated the classroom. Perhaps after ten or twelve years of th...

متن کامل

Optimal buffer allocation in tandems of last come first served queues

A large fixed number of buffer spaces is given. We consider the problem of allocating these spaces among the nodes of a tandem of last-come-first-served queues with general service time distributions and Poisson external arrivals so as to optimize some performance criterion associated with the time to buffer overflow, such as maximizing its mean or maximizing the probability that it exceeds som...

متن کامل

Burst rescheduling with wavelength and last-hop FDL reassignment in WDM optical burst switching networks

In this paper, we consider the problem of fast and efficient dynamic scheduling of bursts that belong to different classes of priority in wavelength-division multiplexing (WDM)based optical burst switching (OBS) networks with limited optical buffers. In OBS networks, control and data components of a burst are sent separately with a time gap to ensure that resources such as wavelengths and fiber...

متن کامل

A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy

This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scheduling

سال: 2021

ISSN: ['1099-1425', '1094-6136']

DOI: https://doi.org/10.1007/s10951-021-00707-5